A Syntactic Characterization of Minimal Entailment
نویسنده
چکیده
This paper investigates a consistent versions cwaS of sometimes inconsistent Reiter’s closed world assumption cwa, proving (theorem 4.3) that for every ∀-sentence φ and for every ∀-theory Σ, φ ∈ cwaS(Σ) iff Σ `min φ. A relativized version of this characterization (theorem 7.3) remains valid if not all relations are subject to minimization. Moreover, the paper relates cwaS to cwa and to Minker’s generalized closed world assumption GCWA. Finally, a possibility of procedural semantics for cwaS has been indicated.
منابع مشابه
The Look and Feel of a Confident Entailer
The paper presents a software system that embodies a lexico-syntactic approach to the task of Textual Entailment. Although the approach is based on a minimal set of resources it is highly confident. The architecture of the system is open and can be easily expanded with more and deeper processing modules. Results on a standard data set are presented.
متن کاملRational fuzzy attribute logic
We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka style and depending on the choice of structure of truth degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL) or the Rational Product...
متن کاملLING 501, Fall 2004: Laws of logic and the definitions of the connectives
Laws of logic Logic is the theory of entailment over a set of objects, for example the members of the set PL of well-formed formulas of the propositional logic PL. The entailment relation can be defined in terms of the form of those objects, i.e. syntactically, or in terms of their meaning, i.e. semantically. Syntactic entailment for propositional logic is generally represented in the form (A),...
متن کاملTextual Entailment as Syntactic Graph Distance: a rule based and a SVM based approach
In this paper we define a measure for textual entailment recognition based on the graph matching theory applied to syntactic graphs. We describe the experiments carried out to estimate measure’s parameters with SVM and we report the results obtained on the Textual Entailment Challenge development and testing set.
متن کاملChinese Textual Entailment Recognition Based on Syntactic Tree Clipping
Textual entailment has been proposed as a unifying generic framework for modeling language variability and semantic inference in different Natural Language Processing (NLP) tasks. This paper presents a novel statistical method for recognizing Chinese textual entailment in which lexical, syntactic with semantic matching features are combined together. In order to solve the problems of syntactic ...
متن کامل